Computational Completeness of Tissue P Systems with Conditional Uniport
نویسندگان
چکیده
The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that rules move only one object at a time, but this may be with the help of another one acting as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that they can recognize all recursively enumerable sets of natural numbers. This is achieved by simulating deterministic register machines.
منابع مشابه
On Communication in Tissue P Systems: Conditional Uniport
The paper introduces (purely communicative) tissue P systems with conditional uniport. Conditional uniport means that every application of a communication rule moves one object in a certain direction by possibly using another one as an activator which is left untouched in the place where it is. Tissue P systems with conditional uniport are shown to be computationally complete in the sense that ...
متن کاملGeneralized communicating P systems
This paper considers a generalization of various communication models based on the P system paradigm where two objects synchronously move across components. More precisely, the model uses blocks of four cells such that pairs of objects from two input cells travel together to target output cells. It is shown that the model introduced, based on interactions between blocks, is complete, being able...
متن کاملCompleteness of Narrowing for Orthogonal Conditional Rewrite Systems
Conditional narrowing is underlying computational mechanism of most functional-logic programming languages. It is important to ensure completeness of conditional narrowing for conditional term rewriting systems without assumption of termination because termination is a too severe restriction for programming languages. In this paper we show completeness of conditional narrowing for a kind of ort...
متن کاملUniversal P Systems: One Catalyst Can Be Sufficient
Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using specific variants of additional control mechanisms. At each step using only multiset rules from one set of a finite number of sets of rules allows for obtaining computational completeness with one catalyst and only one membrane. If the...
متن کاملRandom Context and Semi-conditional Insertion-deletion Systems
In this article we introduce the operations of insertion and deletion working in a random-context and semi-conditional manner. We show that the conditional use of rules strictly increase the computational power. In the case of semi-conditional insertion-deletion systems context-free insertion and deletion rules of one symbol are sufficient to get the computational completeness. In the random co...
متن کامل